Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Concordance parfaite")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 142

  • Page / 6
Export

Selection :

  • and

A visual proof of a result of Knuth on spanning trees of Aztec diamonds in the case of odd orderCIUCU, Mihai.Discrete mathematics. 2007, Vol 307, Num 15, pp 1957-1960, issn 0012-365X, 4 p.Article

Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubesGREGOR, Petr.Discrete mathematics. 2009, Vol 309, Num 6, pp 1711-1713, issn 0012-365X, 3 p.Article

On the maximum number of edges in a hypergraph with a unique perfect matchingBAL, Deepak; DUDEK, Andrzej; YILMA, Zelealem B et al.Discrete mathematics. 2011, Vol 311, Num 21, pp 2577-2580, issn 0012-365X, 4 p.Article

Characterizing minimally n-extendable bipartite graphsDINGJUN LOU.Discrete mathematics. 2008, Vol 308, Num 11, pp 2269-2272, issn 0012-365X, 4 p.Article

A note on internally disjoint alternating paths in bipartite graphsDINGJUN LOU; SAITO, Akira; LIHUA TENG et al.Discrete mathematics. 2005, Vol 290, Num 1, pp 105-108, issn 0012-365X, 4 p.Article

ON PERFECT MATCHINGS IN UNIFORM HYPERGRAPHS WITH LARGE MINIMUM VERTEX DEGREEHAN, Hiêp; PERSON, Yury; SCHACHT, Mathias et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 732-748, issn 0895-4801, 17 p.Article

Connections between Wiener index and matchingsWEIGEN YAN; YEH, Yeong-Nan.Journal of mathematical chemistry. 2006, Vol 39, Num 2, pp 389-399, issn 0259-9791, 11 p.Article

Double bonds in fused hexacyclic systemsKARIMI, Sasan; LEWINTER, Marty; STAUFFER, Julian et al.Journal of mathematical chemistry. 2003, Vol 34, Num 3-4, pp 297-301, issn 0259-9791, 5 p.Article

A characterization of (2γ, γp)-treesXINMIN HOU.Discrete mathematics. 2008, Vol 308, Num 15, pp 3420-3426, issn 0012-365X, 7 p.Article

A quadratic identity for the number of perfect matchings of plane graphsWEIGEN YAN; FUJI ZHANG.Theoretical computer science. 2008, Vol 409, Num 3, pp 405-410, issn 0304-3975, 6 p.Article

A note on minimal matching covered graphsMKRTCHYAN, V. V.Discrete mathematics. 2006, Vol 306, Num 4, pp 452-455, issn 0012-365X, 4 p.Article

Characterizations of trees with equal paired and double domination numbersBLIDIA, Mostafa; CHELLALI, Mustapha; HAYNES, Teresa W et al.Discrete mathematics. 2006, Vol 306, Num 16, pp 1840-1845, issn 0012-365X, 6 p.Article

On the hardness of graph isomorphismTORAN, Jacobo.SIAM journal on computing (Print). 2004, Vol 33, Num 5, pp 1093-1108, issn 0097-5397, 16 p.Article

A lower bound for approximating the geometric minimum weight matchingDAS, G; SMID, M.Information processing letters. 2000, Vol 74, Num 5-6, pp 253-255, issn 0020-0190Article

A lower bound on the number of removable ears of 1-extendable graphsSHAOHUI ZHAI; LUCCHESI, Cláudio L; XIAOFENG GUO et al.Discrete mathematics. 2010, Vol 310, Num 5, pp 1123-1126, issn 0012-365X, 4 p.Article

Distance-restricted matching extension in planar triangulationsALDRED, R. E. L; PLUMMER, Michael D.Discrete mathematics. 2010, Vol 310, Num 20, pp 2618-2636, issn 0012-365X, 19 p.Article

On the p-factor-criticality of the Klein bottlePLUMMER, Michael D; XIAOYA ZHA.Discrete mathematics. 2004, Vol 287, Num 1-3, pp 171-175, issn 0012-365X, 5 p.Article

An optimal deterministic algorithm for online b-matchingKALYANASUNDARAM, B; PRUHS, K. R.Theoretical computer science. 2000, Vol 233, Num 1-2, pp 319-325, issn 0304-3975Article

2-extendability and k-resonance of non-bipartite Klein-bottle polyhexesQIULI LI; SAIHUA LIU; HEPING ZHANG et al.Discrete applied mathematics. 2011, Vol 159, Num 8, pp 800-811, issn 0166-218X, 12 p.Article

Matching preclusion for k-ary n-cubesSHIYING WANG; RUIXIA WANG; SHANGWEI LIN et al.Discrete applied mathematics. 2010, Vol 158, Num 18, pp 2066-2070, issn 0166-218X, 5 p.Article

Maximally resonant polygonal systemsSAIHUA LIU; HEPING ZHANG.Discrete mathematics. 2010, Vol 310, Num 21, pp 2790-2800, issn 0012-365X, 11 p.Article

2-extendability of toroidal polyhexes and Klein-bottle polyhexesDONG YE; HEPING ZHANG.Discrete applied mathematics. 2009, Vol 157, Num 2, pp 292-299, issn 0166-218X, 8 p.Article

Relations between Clar structures, Clar covers, and the sextet-rotation tree of a hexagonal systemSHAN ZHOU; HEPING ZHANG; GUTMAN, Ivan et al.Discrete applied mathematics. 2008, Vol 156, Num 10, pp 1809-1821, issn 0166-218X, 13 p.Article

4-regular claw-free IM-extendable graphsWANG QIN; YUAN JINJIANG.Discrete mathematics. 2005, Vol 294, Num 3, pp 303-309, issn 0012-365X, 7 p.Article

Perfect matching in general vs. cubic graphs : A note on the planar and bipartite casesBAMPIS, E; GIANNAKOS, A; KARZANOV, A et al.Informatique théorique et applications (Imprimé). 2000, Vol 34, Num 2, pp 87-97, issn 0988-3754Article

  • Page / 6